Updating the Inverse of a Matrix When Removing the $i$th Row and Column with an Application to Disease Modeling

نویسنده

  • Cody Palmer
چکیده

The Sherman-Woodbury-Morrison (SWM) formula gives an explicit formula for the inverse perturbation of a matrix in terms of the inverse of the original matrix and the perturbation. This formula is useful for numerical applications. We have produced similar results, giving an expression for the inverse of a matrix when the ith row and column are removed. However, our expression involves taking a limit, which inhibits use in similar applications as the SWM formula. However, using our expression to find an analytical result on the spectral radius of a special product of two matrices leads to an application. In particular, we find a way to compute the fundamental reproductive ratio of a relapsing disease being spread by a vector among two species of host that undergo a different number of relapses.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Mathematics : The Abelian Sandpile Model

Exercise 7. Let A be an n × n matrix such that the sum of every row is 0 and the sum of every column is 0. Let Aij be the (n − 1) × (n − 1) matrix obtained by removing row i and column j from A. Prove: det(Aij) = (−1) det(A11). (Note that this result applies in particular to the Laplacian L: the determinant of the reduced Laplacian, obtained by removing the i-th row and the i-th column from L, ...

متن کامل

Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips

In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...

متن کامل

A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

متن کامل

Linear preservers of g-row and g-column majorization on M_{n,m}

Let A and B be n × m matrices. The matrix B is said to be g-row majorized (respectively g-column majorized) by A, if every row (respectively column) of B, is g-majorized by the corresponding row (respectively column) of A. In this paper all kinds of g-majorization are studied on Mn,m, and the possible structure of their linear preservers will be found. Also all linear operators T : Mn,m ---> Mn...

متن کامل

A method for solving fully fuzzy linear system

In this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form Ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where A~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisting o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016